On the Number of hv-Convex Discrete Sets
نویسنده
چکیده
One of the basic problems in discrete tomography is the reconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfills some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. The class of hv-convex discrete sets and its subclasses have a well-developed theory. Several reconstruction algorithms as well as some complexity results are known for those classes. The key to achieve polynomial-time reconstruction of an hv-convex discrete set is to have the additional assumption that the set is connected as well. This paper collects several statistics on hv-convex discrete sets, which are of great importance in the analysis of algorithms for reconstructing such kind of discrete sets.
منابع مشابه
Generation and Empirical Investigation of hv -Convex Discrete Sets
One of the basic problems in discrete tomography is the reconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfils some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. Since the reconstruction from two projections in the class of so-called hv-convex sets...
متن کاملReconstruction of convex 2D discrete sets in polynomial time
The reconstruction problem is considered in those classes of discrete sets where the reconstruction can be performed from two projections in polynomial time. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex 8-connected sets, hv-convex polyominoes, and directed h-convex sets. As new results some properties of the feet and spines of the ...
متن کاملComparison of algorithms for reconstructing hv-convex discrete sets
Three reconstruction algorithms to be used for reconstructing hv-convex discrete sets from their row and column sums are compared. All these algorithms have two versions: one for reconstructing hv-convex polyominoes and another one for reconstructing hv-convex 8-connected discrete sets. In both classes of discrete sets the algorithms are compared from the viewpoints of average execution time an...
متن کاملReconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections
The problem of reconstructing some special hv-convex discrete sets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class – the class of hv-convex canonical discrete sets – and give a constructive proof th...
متن کاملReconstruction of Discrete Sets from Four Projections: Strong Decomposability
In this paper we introduce the class of strongly decomposable discrete sets and give an efficient algorithm for reconstructing discrete sets of this class from four projections. It is also shown that every Q-convex set (along the set of directions {x, y}) consisting of several components is strongly decomposable. As a consequence of strong decomposability we get that in a subclass of hv-convex ...
متن کامل